Automated systems for reducing computational loads in the mass execution of analytical models using scale-out computing

ABSTRACT

Disclosed embodiments provide systems and techniques for mass execution of analytical models across multiple dimensions of client, collateral, deal structure, third party, and other data relevant to predicting optimal decisions in real-time. In some embodiments, disclosed systems and techniques increase decisioning speed through the reduction of computational loads on disclosed decisioning systems. Further disclosed systems and techniques may scale-out analytical modeling computations through, among other technological solutions, advanced execution environments that are asynchronous and non-blocking in nature so as to allow the execution of a plurality of analytical models in parallel and optimizing the results.

RELATED APPLICATIONS

This application is a continuation of and claims the benefits of U.S.patent application Ser. No. 15/381,906, filed Dec. 16, 2016, whichclaims the priority of U.S. Provisional Patent Application No.62/269,529, filed Dec. 18, 2015. The U.S. patent application Ser. No.15/381,906 and the U.S. Provisional Patent Application No. 62/269,529are hereby incorporated by reference in their entireties.

BACKGROUND

The mass execution of analytical models across many dimensions of datato predict optimal transaction decisions is a computationally intensiveand data intensive job that cannot be feasibly implemented in real-timeon traditional computing systems. As a result, current decisioningsystems require parties to iterate over potential transactions andtransaction structures with only a vague sense of direction. Moreover,the more negotiable parameters that are added to a proposed transactionstructure, the more exacerbated the shortcomings of existing decisioningsystems become.

In view of these and other shortcomings and problems with traditionaldecisioning systems, improved systems and techniques for conducting massexecution of analytical models across many dimensions of data aredesired in order to predict optimal transaction decisions in real-time.

SUMMARY

Disclosed embodiments provide systems and techniques for mass executionof analytical models across multiple dimensions of client, collateral,deal structure, third party, and other data relevant to predictingoptimal decisions in real-time. In some embodiments, disclosed systemsand techniques increase decisioning speed through the reduction ofcomputational loads on disclosed decisioning systems. Further disclosedsystems and techniques may scale-out analytical modeling computationsthrough, among other technological solutions, advanced executionenvironments that are asynchronous and non-blocking in nature so as toallow the execution of a plurality of analytical models in parallel (andoptimizing the results). Disclosed systems and techniques may alsoincrease decisioning computation speeds by determining a minimallyviable transaction (MVT) structure used for verifying an initialtransaction proposal and setting the maximum extent that a transactionstructure can become modified and remain acceptable. In someembodiments, disclosed systems and techniques may further identify anoptimal transaction structure by executing a plurality of transactionstructure variations for every transaction policy, and scoring, sorting,and ranking the variations. For example, disclosed embodiments may useparallel computing and big data techniques to scale-out the execution ofanalytical models against many variations of input to produce a range oftransaction outcomes. These outcomes may then be analyzed against targetdecision outcomes to provide an optimal set of discreet decisionpossibilities.

Thus, the disclosed embodiments provide enhancements to decisioningsystem technology, and address problems with traditional decisioningsystems unable to produce a similar range of tailored transactionoutcomes, much less providing such outcomes in a timely fashion. Thedisclosed systems and methods may be implemented using a combination ofconventional hardware, firmware, and/or software as well as specializedhardware, firmware, and/or software, such as a machine constructedand/or programmed specifically for performing functions associated withthe disclosed method steps. In some embodiments, however, disclosedsystems and methods may be implemented instead in dedicated electronicshardware.

Consistent with the present embodiments, a system for mass execution ofanalytical models is disclosed. The system may include a memory storinginstructions and one or more processors. The one or more processors maybe configured to execute the instructions to perform operations. Theoperations may include, for example, receiving, via an ApplicationProgramming Interface (API), a transaction proposal including a firstplurality of transaction parameters. The operations may further includeiteratively verifying, via an actor pool associated with a datainterface module, a plurality of data sources identified based on thereceived transaction proposal. The operations may also includegenerating a minimally viable transaction (MVT) including a secondplurality of transaction parameters based on the transaction proposal.The operations may further include generating, via an actor poolassociated with a transaction generator, a plurality of transactionoptions based on the transaction proposal and the MVT. The operationsmay also include scoring, via an actor pool associated with a scoringengine, each of the plurality of transaction options using the at leastone analytical model, and verifying, via an actor pool associated with apolicy calculator, that the each of the plurality of transaction optionscomplies with a transaction policy based on the scoring. The operationsmay also include optimizing, via an actor pool associated with atransaction optimizer, the plurality of transaction options based on atleast one preference, and transmitting, via the API, at least onetransaction offer based on the optimized plurality of transactionoptions.

Consistent with the present embodiments, a method for mass execution ofanalytical models is disclosed. The method may include, for example,receiving, via an Application Programming Interface (API), a transactionproposal including a first plurality of transaction parameters. Themethod may further include iteratively verifying, via an actor poolassociated with a data interface module, a plurality of data sourcesidentified based on the received transaction proposal. The method mayalso include generating a minimally viable transaction (MVT) including asecond plurality of transaction parameters based on the transactionproposal. The method may further include generating, via an actor poolassociated with a transaction generator, a plurality of transactionoptions based on the transaction proposal and the MVT. The method mayalso include scoring, via an actor pool associated with a scoringengine, each of the plurality of transaction options using the at leastone analytical model, and verifying, via an actor pool associated with apolicy calculator, that the each of the plurality of transaction optionscomplies with a transaction policy based on the scoring. The method mayalso include optimizing, via an actor pool associated with a transactionoptimizer, the plurality of transaction options based on at least onepreference, and transmitting, via the API, at least one transactionoffer based on the optimized plurality of transaction options.

Aspects of the disclosed embodiments may include tangiblecomputer-readable media that store software instructions that, whenexecuted by one or more processors, are configured for and capable ofperforming and executing one or more of the methods, operations, and thelike consistent with the disclosed embodiments.

The foregoing general description and the following detailed descriptionare exemplary and explanatory only and are not restrictive of theclaims.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute apart of this specification, illustrate several embodiments and, togetherwith the description, serve to explain the disclosed principles. In thedrawings:

FIG. 1 is a schematic diagram illustrating an exemplary systemenvironment for mass execution of analytical models using scale-outcomputing to predict optimal decisions, consistent with disclosedembodiments.

FIG. 2. is a diagram of an exemplary decisioning engine systemconfigured to perform functions of the disclosed methods, consistentwith disclosed embodiments.

FIG. 3 is an exemplary decisioning system 300 and decisioning modulemessaging handling sequence for predicting optimal decisions, consistentwith disclosed embodiments.

FIG. 4 is an exemplary table reflecting transaction proposals,consistent with disclosed embodiments.

FIG. 5 is an exemplary interface for receiving transaction proposaldata, consistent with disclosed embodiments.

FIGS. 6A-B are exemplary interfaces for displaying a transactionproposal response, consistent with disclosed embodiments.

FIGS. 7A-B are exemplary interfaces for presenting offers, consistentwith disclosed embodiments.

DESCRIPTION OF THE EMBODIMENTS

Disclosed embodiments improve the intelligence of real-time decisioningsystems by configuring advanced execution environments that areasynchronous and non-blocking in nature so as to allow the parallelexecution of analytical models across multiple dimensions of datarelevant to predicting optimal decisions. To achieve these improvementsin decisioning technology, among other things, the disclosed embodimentsmay determine a minimally viable transaction (MVT) structure, settingthe maximum extent that a transaction structure can become modified andremain acceptable, and scale-out the analytical modeling computationsonly within the acceptable range of variations.

In some embodiments, disclosed systems and techniques may furtheridentify an optimal transaction structure (or set of structures) byexecuting transaction structure variations for every transaction policyand scoring, sorting, and ranking the variations. For example, disclosedembodiments may use parallel computing and big data techniques toscale-out the computation of analytical models against many variationsof input to produce a range of transaction outcomes. These outcomes maythen be analyzed against target decision outcomes to provide an optimalset of discreet decision possibilities.

Reference will now be made in detail to exemplary embodiments, examplesof which are illustrated in the accompanying drawings and disclosedherein. Wherever convenient, the same reference numbers will be usedthroughout the drawings to refer to the same or like parts. For ease ofdiscussion, the present disclosure may describe embodiments in thecontext of a financial service provider predicting an optimal set ofvehicle loan offers in response to receiving a loan application. It isto be understood, however, that disclosed embodiments are not limited tothe vehicle loans, home loans, land loans, personal loans, lines ofcredit, sale of goods or services, etc. Rather, disclosed systems andtechniques for mass execution of analytical models across multipledimensions of data relevant to predicting optimal decisions in real-timemay be employed to respond to any type of negotiation involving variableterms. Indeed, disclosed embodiments are not limited to the financialservice industry and, in fact, are not limited to any particularindustry or field.

FIG. 1 is a schematic diagram of an exemplary system environment formass execution of analytical models using scale-out computing to predictoptimal decisions, consistent with disclosed embodiments. In particular,FIG. 1 shows a diagram of an exemplary system 100, consistent withdisclosed embodiments, revealing some technical aspects of the presentdisclosure for achieving the intended results of the present disclosure.Referring to FIG. 1, system 100 may include a plurality of clientdevices 102, a network 104, local network 106, a decision engine system108, a plurality of data repositories 110, a plurality of serverclusters 112, and a cloud service 114. The components and arrangement ofthe components included in system 100 may vary. Thus, system 100 mayfurther include other components or devices that perform or assist inthe performance of one or more processes consistent with the disclosedembodiments. The components and arrangements shown in FIG. 1 are notintended to limit the disclosed embodiments, as the components used toimplement the disclosed processes and features may vary.

As shown in FIG. 1, the plurality of client services 102 may beimplemented using a variety of different equipment, such assupercomputers, personal computers, servers, mainframes, mobile deviceslike smart phones and tablets, etc. In some embodiments, clientdevice(s) 102 may be configured to receive input from a user, such asinput regarding a transaction proposal (e.g., a loan application). Forexample, client device(s) 102 may execute a web browser application topresent a web page through which a user may submit a transactionproposal. Client devices 102 may send that inputted data (e.g.,transaction proposal) to decision engine system 108 for processing. Insome embodiments, client device(s) 102 may be associated with anapplicant for a vehicle loan. Additionally or alternatively, clientdevice(s) 102 may be associated with an intermediary or point of sale,such as an automotive dealer. Client devices 102 may be connected to anetwork such as network 104. In some embodiments, client devices 102 maybe connected to a local network (e.g., a local network of an automotivedealer), such as local network 106.

Network 104, in some embodiments, may comprise one or moreinterconnected wired or wireless data networks that receive data fromone device (e.g., decision engine system 108) and send it to anotherdevice (e.g., server clusters 112 and/or cloud service 114). Forexample, network 104 may be implemented as the Internet, a wired WideArea Network (WAN), a wired Local Area Network (LAN), a wireless LAN(e.g., IEEE 802.11, Bluetooth, etc.), a wireless WAN (e.g., WiMAX), orthe like. Each component in system 100 may communicate bidirectionallywith other system 100 components either through network 104 or throughone or more direct communication links (not shown).

Decision engine system 108 may be implemented using a variety ofdifferent equipment, such as one or more supercomputers, one or morepersonal computers, one or more servers (e.g., server clusters 112and/or cloud service 114), one or more mainframes, one or more mobiledevices, or the like. In some embodiments, decision engine system 108may comprise hardware, software, and/or firmware modules. Decisionengine system 108 may be configured to receive a transaction proposalincluding a proposed transaction structure (e.g., a loan applicationproposing a set of terms), identifying flexible parameters of theproposed transaction structure (e.g., a loan amount, cash down required,annual percentage rate (APR), length of loan, warranty costs, etc.),coordinate parallel computing of analytical models against the potentialvariations of the transaction structure given the flexible transactionparameters, and score and rank the potential variations according to thepreferences of those involved in the proposed transaction (e.g., afinancial service provider, automotive dealer, and/or vehicle purchaserand loanee). In some embodiments, decision engine system 108 may runmachine learning, trending, and/or pattern recognition algorithms tofurther refine the identification and/or ranking of transactionstructures that appeal to involved parties. Additionally oralternatively, decision engine system 108 may present the identifiedtransaction structures in a spider graph (e.g., web chart, star chart,star plot, cobweb chart, irregular polygon, polar chart, kiviat diagram,etc.) having radii representing, for example, various variable terms ofthe transaction.

Data repositories 110 may be configured to store information consistentwith the disclosed embodiments. In some aspects, components of system100 (shown and not shown) may be configured to receive, obtain, gather,collect, generate, or produce information to store in data repositories110. In certain embodiments, for instance, components of system 100 mayreceive or obtain information for storage over communications network104 (and/or local network 106). By way of example, data repositories 110may store vehicle inventory information of an automotive dealer. Inanother example, data repositories 110 may store credit informationassociated with individuals collected and/or generated by a creditbureau. In other aspects, components of system 100 may store informationin data repository 110 without using network 104 (e.g., via a directconnection). In some embodiments, components of system 100, includingbut not limited to decision engine system 108, may use informationstored within data repository 110 for processes consistent with thedisclosed embodiments

Server clusters 112 may be located in the same data center or indifferent physical locations. Multiple server clusters 112 may be formedas a grid to share resources and workloads. Each server cluster 112 mayinclude a plurality of linked nodes operating collaboratively to runvarious applications, software modules, analytical models, rule engines,etc. Each node may be implemented using a variety of differentequipment, such as a supercomputer, personal computer, a server, amainframe, a mobile device, or the like. In some embodiments, the numberof servers and/or server clusters 112 may be expanded or reduced basedon workload. In some embodiments, one or more components of decisionengine system 108 (including one or more server clusters 112) may beplaced behind a load balancer to support high availability and ensurereal-time (or near real-time) processing of optimal decisionpredictions, consistent with disclosed embodiments.

Cloud service 114 may include a physical and/or virtual storage systemassociated with cloud storage for storing data and providing access todata via a public network such as the Internet. Cloud service 114 mayinclude cloud services such as that offered by, for example, Amazon,Apple, Cisco, Citrix, IBM, Joyent, Google, Microsoft, Rackspace,Salesforce.com and Verizon/Terremark, or other types of cloud servicesaccessible via network 104.

In some embodiments, cloud service 114 comprises multiple computersystems spanning multiple locations and having multiple databases ormultiple geographic locations associated with a single or multiple cloudstorage service(s). As used herein, cloud service 114 refers to physicaland virtual infrastructure associated with a single cloud storageservice. In some embodiments, cloud service 114 manages and/or storesdata associated with mass execution of analytical models using scale-outcomputing to predict optimal decisions.

FIG. 2 is a diagram of an exemplary decisioning engine configured toperform functions of the disclosed methods, consistent with disclosedembodiments. As shown, decision engine system 108 may include one ormore processor 260, input/output (“I/O”) devices 270, and memory 280storing data and programs 282 (including, for example, structure risk(SR) model(s) 284, applicant risk (AR) model(s), and operating system288). As noted above, decision engine system 108 may be a single serveror may be configured as a distributed computer system including multipleservers or computers (e.g., server clusters 112 and/or cloud service114) that interoperate to perform one or more of the processes andfunctionalities associated with the disclosed embodiments. In someembodiments, decision engine system 108 is specially configured withhardware and/or software modules for performing functions of disclosedmethods. For example, decision engine system 108 may include programs282 (including Structure Rating (SR) model(s) 284 and Applicant Rating(AR) model(s)) and/or decisioning module(s) 292. The modules can beimplemented as specialized circuitry integrated within processor 260 orin communication with processor 260, and/or specialized software storedin memory 280 (as depicted in FIG. 2) executable by processor 260.

Processor 260 may be one or more known or custom processing devicesdesigned to perform functions of the disclosed methods, such as a singlecore or multiple core processors capable of executing parallel processessimultaneously. For example, processor 260 may be configured withvirtual processing technologies. In certain embodiments, processor 260may use logical processors to simultaneously execute and controlmultiple processes. Processor 260 may implement virtual machinetechnologies, including a Java virtual machine, or other knowntechnologies to provide the ability to execute, control, run,manipulate, store, etc. multiple software processes, applications,programs, etc. In another embodiment, processor 260 may include amultiple-core processor arrangement (e.g., dual core, quad core, etc.)configured to provide parallel processing functionalities to allowdecision engine system 108 to execute multiple processes simultaneously.One of ordinary skill in the art would understand that other types ofprocessor arrangements could be implemented that provide for thecapabilities disclosed herein.

Decision engine system 108 may also include one or more I/O devices 270that may comprise one or more interfaces for receiving signals or inputfrom devices and providing signals or output to one or more devices thatallow data to be received and/or transmitted by decision engine system108. Decision engine system 108 may also include interface componentsthat display information and/or provide interfaces to one or more inputdevices, such as one or more keyboards, mouse devices, and the like,that enable in decision engine system 108 to receive input from a useror administrator (not shown).

Decision engine system 108 may include one or more storage devicesconfigured to store information used by processor 260 (or othercomponents) to perform certain functions related to the disclosedembodiments. In one example, decision engine system 108 may includememory 280 that includes instructions to enable processor 260 to executeone or more applications, such as SR model(s) 284 and/or AR model(s),server applications, network communication processes, and any other typeof application or software known to be available on computer systems.Alternatively or additionally, the instructions, application programs,etc. may be stored in an internal database or external storage (notshown) in direct communication with decision engine system 108, such asone or more database or memory accessible over network 104. The internaldatabase and external storage may be a volatile or non-volatile,magnetic, semiconductor, tape, optical, removable, non-removable, orother type of storage device or tangible (i.e., non-transitory)computer-readable medium.

Decision engine system 108 may also be communicatively connected to oneor more remote memory devices (e.g., remote databases (not shown))through network 104 or a different network. The remote memory devicesmay be configured to store information (e.g., structured,semi-structured, and/or unstructured data) and may be accessed and/ormanaged by decision engine system 108. By way of example, the remotememory devices may be document management systems, Microsoft SQLdatabase, SharePoint databases, Oracle™ databases, Sybase™ databases, orother relational databases. Systems and methods consistent withdisclosed embodiments, however, are not limited to separate databases oreven to the use of a database.

In one embodiment, decision engine system 108 may include memory 280that includes instructions that, when executed by processor 260, performone or more processes consistent with the functionalities disclosedherein. Methods, systems, and articles of manufacture consistent withdisclosed embodiments are not limited to separate programs or computersconfigured to perform dedicated tasks. For example, decision enginesystem 108 may include memory 280 that may include one or more programs282 and/or decisioning module(s) 292 to perform one or more functions ofthe disclosed embodiments. Moreover, processor 260 may execute one ormore programs located remotely from system 100. For example, decisionengine system 108 may access one or more remote programs, that, whenexecuted, perform functions related to disclosed embodiments.

Memory 280 may include one or more memory devices that store data andinstructions used to perform one or more features of the disclosedembodiments. For example, memory 280 may represent a tangible andnontransitory computer-readable medium having stored therein computerprograms, sets of instructions, code, or data to be executed byprocessor 260. Memory 280 may include, for example, a removable memorychip (e.g., EPROM, RAM, ROM, DRAM, EEPROM, flash memory devices, orother volatile or non-volatile memory devices) or other removablestorage units that allow instructions and data to be accessed byprocessor 260.

Memory 280 may also include any combination of one or more relationaland/or non-relational databases controlled by memory controller devices(e.g., server(s), etc.) or software, such as document managementsystems, Microsoft SQL databases, SharePoint databases, Oracle™databases, Sybase™ databases, or other relational databases, ornon-relational databases such as key-value stores or NoSQL databasessuch as Apache HBase™. In some embodiments, memory 280 may comprise anassociative array architecture, such as a key-value storage, for storingand rapidly retrieving large amounts of information.

Programs 282 stored in memory 280 and executed by processor(s) 260 mayinclude one or more SR model(s) 284, AR model(s) 286, and operatingsystem 288. Programs 282 may also include one or more machine learning,trending, and/or pattern recognition applications (not shown) that causeprocessor(s) 260 to execute one or more processes related toidentifying, scoring, and/or ranking of transaction structures. Forexample, the one or more machine learning, trending, and/or patternrecognition may provide, modify, or suggest input variables associatedwith one or more other programs 282.

Consistent with disclosed embodiments, decision engine system 108 mayexecute one or more scoring models, including but not limited to SRmodel(s) 284 and AR model(s) 286, for every user (e.g., loan applicant),transaction proposal (e.g., loan application), every potential variationof the transaction proposal, and/or response to a transaction proposal(e.g., loan offers). The scoring models may be analytical modelsapplying, for example, linear regression algorithms and/or boosted treealgorithms. The scoring models may leverage structured data (e.g., fixedfield data received from credit bureau databases, data received fromdealer website via an API, etc.) or unstructured data (e.g., images ofloan application documents or supporting documents, images of thecollateral, etc.) produce scores indicating the risk and/oracceptability associated with a user, transaction proposal, allacceptable transaction structure variants of a transaction proposal,and/or transaction proposal responses. For example, in the case of aloan application for an automotive purchase, the scoring models mayproduce a score that rates the applicant, each potential transactionstructure of the loan sought, and/or the loan offers provided inresponse to the auto loan request according to credit risk, loanpreferences, and/or other factors (including those either learned orsuggested).

Consistent with disclosed embodiments, AR model 286 may be configured toassess the risk associated with a user or entity that has submitted atransaction request. For instance, in the example where the applicant isa consumer that submitted a loan application seeking a loan to fund avehicle purchase, AR model 286 may receive input variables associatedwith assessing the consumer's creditworthiness (e.g., FICO score, credithistory, income, etc.) and produce a score rating the credit riskassociated with providing a loan to the consumer. In some embodiments,one or more scores generated by other models (shown and not shown) mayadditionally be received as an input variable. In some embodiments,multiple versions of models may be used in combination to test allaspects of risk.

Consistent with disclosed embodiments, SR model 284 may be configured toassessing the risk associated with potential transaction structures. Forexample, SR model 284 may receive a plurality of input variables thatare acceptable to a transaction policy and produce scores indicating therisk associated with approving a transaction according to thattransaction structure. For instance, continuing the above example, SRmodel 284 may receive input variables associated with a potentialtransaction structure for the sought vehicle loan (e.g., loan to value(LTV) ratio, loan to income (LTI) ratio, AR model 286 score, etc.) andproduce a scoring rating the risk associated with a loan according tothe transaction structure. As discussed herein, SR model 284 may scoreevery potential transaction structure associated with processing atransaction proposal. In some embodiments, one or more scores generatedby other models (shown and not shown) may additionally be received as aninput variable.

According to some embodiments, decision engine system 108 may alsovalidate scores produced by the scoring model(s) according to atransaction policy. The transaction policy may define the relationshipbetween the score produced by a model and the input variables. In someinstances, scores produced by a model within defined ranges may dictatethe range of input variables that are acceptable to the transactionpolicy (referred to herein as the transaction policy rules). Forexample, when an AR model 286 produces a score in a lower range(indicating a higher credit risk associated with the applicant), thenthe transaction policy rules may require the LTV ratio provided as inputfor SR model 284 to remain below a threshold level in order to complywith the transaction policy. In another example, the transaction policyrules may allow a pricing model to accept a higher overall cost (e.g.,loan amount) as an input variable when an SR model score is produced ina high range (indicating a lower risk transaction structure). In someembodiments, the transaction policy rules may dictate which modelsbecome run on the transaction request (and/or variations thereof) basedon input variables and/or scoring my other models.

Decisioning module(s) 292 may be stored in memory 280 and executed byprocessor(s) 260 to implement one or more parts of a decisioning systemcomprising fault-tolerant and scalable applications, such asapplications built upon an Actor, message, or Lambda based architecture.Additional details regarding decisioning module(s) 292 is discussedbelow with respect to exemplary decisioning system 300 of FIG. 3.

FIG. 3 is an exemplary decisioning system 300 and decision modulemessaging handling sequence for predicting optimal decisions, consistentwith disclosed embodiments. As noted above, decisioning system 300 maycomprise one or more fault-tolerant and scalable applications (referredto herein as decisioning module(s) 292) executed by decision enginesystem 108. Decisioning system 300 may be a message-based system whereindecisioning module(s) 292 act on messages sent through the decisioningsystem 300. Decisioning module(s) 292 may include, but are not limitedto: data interface 304, MVT generator 306, score engine 308, potentialtransaction generator 310, policy calculator 312, and/or transactionoptimizer 314.

Each module among decisioning module(s) 292 may be independent to workon a given message as it is received/retrieved. Indeed, althoughoperations discussed below may be described as occurring in a particularsequence for ease of discussion, it should be understood that disclosedoperations, events, etc. may occur in parallel and/or simultaneously.Further, decisioning module(s) 292 may become replicated to scale outoperations as needed to respond to a transaction proposal in real-time.Decisioning module(s) 292 may be deployed as remote actors or ascomponents in big data systems such as Spark or Hadoop. In someembodiments, subsystem 300 may be packaged as a set of JAR (JavaArchive) files or other packaged file format that compose the librariesand decisioning modules 292 used in the subsystem.

Decision engine system 108 (via, e.g., server cluster 112 and/or cloudservice 114) may perform some or all steps of discloses processes viathe specialized hardware and/or software configured to perform functionsrelated to disclosed embodiments. It is to be understood, however, thatin some embodiments one or more other devices may perform one or moresteps described below, such as client devices 102.

As shown in FIG. 3, decision system 300 may receive a transactionproposal via application scoring API 302. For example, a client device102 associated with a vehicle purchaser and/or automotive dealer maymake an API call to a RESTful API to submit a loan application to afinancial institution (or other credit handler) associated with decisionengine system 108. In some embodiments, client device 102 may submit thetransaction proposal via a web page or other access portal. For example,as depicted in FIG. 4, an interface 400 may be provided for acceptingtransaction proposals. Interface 400 may include input fields (textfield, dropdown menus, checkboxes, image upload areas, etc.) foraccepting information associated with a transaction proposal, such avehicle loan application. For example, interface 400 may include avehicle area 410 providing input fields for receiving vehicleidentifying information for a vehicle associated with a loan request.Similarly, interface 400 may include an applicant area 420 providinginput fields for receiving applicant information. Further, interface 400may include a loan area 430 providing input fields for receivingproposed transaction parameters (e.g., requested loan terms). Interface400 may also include an input means 440 for receiving an indication thatthe decision engine may provide loan offers associated with vehiclesother than that identified in vehicle area 410.

Returning to FIG. 3, in some embodiments, a RESTful API 311 may beresponsible for simple data validation, input formatting, etc. anddecline the application based on detected errors without passing on thetransaction proposal to decisioning module(s) 292. Similarly,application scoring API 302 may process the transaction proposal forapplication pre-acceptance and approve the transaction proposal based onpre-acceptance criteria. Application scoring API 302 may construct aproposal message based on the transaction proposal.

Data interface 304 may retrieve the application message and operate asan interface to internal and/or additional data sources (such as creditbureaus, financial service providers, etc.) storing information that maybecome acted upon by other decisioning model(s) 292 in processing thetransaction proposal. For example, data interface 304 may extractidentifying information for a loan applicant from the applicationmessage (e.g., name, address, employers, social security number,driver's license number, financial account number, etc.) and acquire acredit rating for the applicant from a credit bureau, account balance ofthe applicant from financial service providers, income information froman employer of the applicant, etc. Data interface 304 may further parse,store, and validate the acquired data. Data interface 304 may alsoaccess local storage when, for example, the transaction proposal is aresubmission, and the information relevant to the transaction proposal(and/or acting on the transaction proposal) has previously been acquiredby data interface 304. Data interface 304 may further receive input froma user or administrator of decision engine system 108. Data interface304 may construct a message reflecting the application proposal andcollected data.

MVT generator 306 may retrieve the message reflecting the applicationproposal and collected data and generate a minimally viable transaction(MVT). In some embodiments, the MVT may be the maximum extent to which atransaction proposal (e.g., as indicated by the applicant in loan area430) can be modified and remain acceptable. For example, referring toFIG. 5, decision engine system 108 may receive a transaction proposalrequesting a vehicle loan according to a deal structure havingparameters including length of loan 501, sales price 503, cash down 505,and warranty costs 507. As shown in FIG. 5, the transaction proposal mayrequest deal parameters 502 including: a 60-month length of loan, a$25,000 sales price/loan amount, a $1,000 cash down, and $2,500 warrantycost coverage. MVT Generator 306 may modify these deal parameters to themaximum extent the scoring models, such as SR model 284 and AR model286, can produce a score that remains valid under the transactionpolicy. (If an MVT cannot become verified, a message rejecting thetransaction request may be transmitted to the requestor via ApplicationScoring API 302 for presentation.) In the example depicted in FIG. 5,MVT Generator 306 identified MVT parameters 504 including: 75-monthlength of loan, $15,000 sales price, $11,000 cash down, and $0 warrantycost. Data interface 304 may also construct a message reflecting theapplication proposal, collected data, and MVT.

Returning to FIG. 3., score engine 308 may retrieve the messagereflecting the application proposal, collected data, and/or MVT andgenerate an MVT score. (As discussed below, score engine 308 may alsogenerate a score for all transaction parameter variations betweentransaction proposal 502 and MVT 504.) For example, score engine 308 mayapply one or more scoring models, including but not limited to SRmodel(s) 284 and AR model(s) 286 to the MVT structure/MVT parameters 504in order to produce an MVT score indicating the risk associated with theMVT structure. Score engine 308 may pass the MVT score to policycalculator 312 for verification/validation.

Policy calculator 312 may validate the MVT score as conforming to thetransaction policy defining, among other things, the relationshipbetween the score produced by a model and the input variables. Forexample, policy calculator 312 may confirm that all input variables forthe one or more applied scoring models complied with the transactionpolicy associated with the MVT. (As discussed below, policy calculator312 may also validate any and all scores generated on each transactionparameter variation between transaction proposal 502 and MVT 504.)Policy calculator 312 may also construct a message reflecting theapplication proposal, collected data, and validated MVT.

Potential transaction generator 310 may retrieve the message reflectingthe application proposal, collected data, and validated MVT and generatea plurality of transaction options. The plurality of transaction optionsmay represent, for example, alternative transaction structures to thatindicated by the transaction proposal. In particular, potentialtransaction generator 310 may identify all possible transactionparameter variations between transaction proposal 502 and MVT 504. Forexample, potential transaction generator 310 may identify variationincrements 506 (e.g., step deltas) for incrementing or decrementing eachtransaction parameter 501, 503, 505, and 507 between the parametersassociated with transaction proposal 502 and MVT 504. Thus, with respectto the example depicted in FIG. 5, potential transaction generator 310may identify a variation increment 506 for the length of loan parameter501 as being 6-month increments (between 60-75 months), $500 incrementsfor the sales price parameter 503 (between $15,000-$25,000), $500increments for the cash down parameter 505 (between $1,000-$11,000), and$100 increments for the warranty costs parameter 507 (between$0-$2,500). Thus, with the minimum value, maximum value, and variationincrement known for each transaction parameter, potential transactiongenerator 310 may identify all possible combinations of the transactionparameters between transaction proposal 502 and MVT 504 at the variationincrements 506. The resulting set of transaction options may beexpressed as a transaction structure vector.

Score engine 308 may retrieve a message reflecting at least thetransaction structure vector and generate a transaction option score foreach transaction operation identified by potential transaction generator310. For example, score engine 308 may apply one or more scoring models,including but not limited to SR model(s) 284 and AR model(s) 286 to eachtransaction option to produce a transaction option score indicating therisk associated with each transaction option. The scoring may occur inthe same or similar manner as discussed above with respect to scoringMVT 504. Score engine 308 may pass the transaction option scores topolicy calculator 312.

Policy calculator 312 may validate the transaction option scores asconforming to transaction policy. For example, policy calculator 312 mayconfirm that all input variables for the one or more applied scoringmodels complied with the transaction policy associated with theunderlying transaction option scored. Policy calculator 312 may alsoconstruct a message reflecting the application proposal, collected data,transaction structure vector, and validated transaction option scores(which may be similarly expressed in vector form).

Potential transaction generator 310 may also identify one or moreadditional vehicles and generate a plurality of additional transactionoptions as alternatives to transaction proposal. For example, potentialtransaction generator 310 may identify one or more additional vehiclesas an alternative to the vehicle associated with the transactionproposal when the transaction proposal is not valid (e.g., when thetransaction proposal does not fall within the MVT parameters and/orpolicy calculator 312 determined the MVT score was invalid for notconforming to the transaction policy). In other embodiments, potentialtransaction generator 310 may identify one or more additional vehiclesas an alternative to supplement to the transaction options associatedwith the original vehicle. For example, the applicant may have indicatedin input means 440 a desire to receive loan offers for vehicles otherthan that identified in the transaction proposal. Potential transactiongenerator 310 may identify the one or more additional vehicles based onone or more preferences associated with the customer and/or dealer.

Regardless, each alternative associated with an additional vehicle maybecome subjected to the same or similar processing, scoring, validation,etc. as discussed above with respect to the transaction proposal, MVTtransaction structure, and transaction options. Specifically, for eachadditional vehicle, MVT generator 306 may generate an additional MVT inthe same or similar manner to that done above with respect to thetransaction proposal and vehicle identified therein. Score engine 308may also score each of the additional MVTs, and policy calculator 312may verify that each of the additional MVTs comply with transactionpolicy. Potential transaction generator 310 may then retrieve a messagereflecting all the verified additional MVTs and generate a plurality oftransaction options as alternatives to the transaction structureindicated the transaction proposal for each additional vehicle. Theresulting set of additional transaction options may be expressed as anadditional transaction structure vector.

Transaction optimizer 314 may retrieve a message indicating thepotential transactions (e.g., the transaction proposal, MVT transaction,the plurality of transaction options (e.g., transaction structurevector), and plurality of additional transaction options (e.g.,additional transaction structure vector, and associated validatedscores) and construct an optimized response to the transaction proposal.For example, transaction optimizer 314 may prioritize the potentialtransactions according to transaction score (e.g., MVT score,transaction option scores, etc.) and/or customer preferences, dealerpreferences, and/or lender preferences. In some embodiments, theoptimizer may select transactions based on learned preferences based onhistorical trends of similar transactions. In some embodiments,transaction optimizer 314 may select a predetermined number of toptransaction scores to provide in ranked order as deal offers to theapplicant. Additionally or alternatively, transaction optimizer 314 mayprioritize potential transactions according to a customer preferenceassociated with one or more transaction parameters or associated offerterms. For example, transaction optimizer 314 may prioritize potentialtransactions based on the APR based on a customer preference for a lowAPR over other parameter considerations. Similarly, transactionoptimizer 314 may prioritize the potential transactions based on acustomer preference for lower monthly payments over other parameterconsiderations. Transaction optimizer 314 may generate an offer messagereflecting the optimized response to the transaction proposal reflectingthe prioritized/ranked deal offers.

The offer message may be transmitted to the requestor via ApplicationScoring API 302 for presentation. For example, decision engine 108 maygenerate web page data for client device 102 to display the offermessage. FIGS. 6A-B are exemplary interfaces for displaying atransaction proposal response (e.g., an offer message), consistent withdisclosed embodiments.

As depicted in FIG. 6A, an interface 600 may become generated with aselectable area 610 indicating that the transaction proposal is acceptedand disclosing the offer terms (e.g., APR rate, monthly payment, etc.).Interface 600 may also include an area 620 providing additional rankedoffers and indicating one or more differences (longer length of loan,lower interest rate, lower monthly payment, etc.) between the rankedoffers and the offer terms of the accepted transaction proposal. Theranked offers may be selectable by the user operating client device 102.Additionally or alternatively, interface 600 may present the identifiedtransaction structures in a spider graph (e.g., web chart, star chart,star plot, cobweb chart, irregular polygon, polar chart, kiviat diagram,etc.) having radii representing, for example, various variable terms ofthe transaction. Interface 600 may additionally include a selectable tem630 for receiving additional alternative offers.

As depicted in FIG. 6B, an interface 650 may become generated with aarea 660 indicating that the transaction proposal is rejected. Interface650 may also include an area 670 providing alternative ranked offers andindicating one or more differences (different vehicle, larger cash downpayment, etc.) between the ranked offers and the offer terms of therejected transaction proposal. The ranked offers may be selectable bythe user operating client device 102. Interface 600 may additionallyinclude a selectable tem 630 for receiving additional alternativeoffers.

FIGS. 7A-B are exemplary interfaces for presenting offers, consistentwith disclosed embodiments. According to some embodiments, decisionengine 108 may provide an interface 700 for presenting a plurality ofoffers and receiving user input associate with the plurality of offers.As shown in FIG. 7A, interface 700 may include an area 710 displaying anadjustable slider bar associated with each of a plurality of transactionparameters. For example, area 710 may include a length of loan sliderbar 721, sales price slider bar 722, cash down slider bar 723, andwarranty costs slider bar 724. The value range of each transactionparameter may be based on, for example, the transaction proposal andMVT. In some embodiments, decision engine 108 will present the sliderbars as positioned at the values indicated in the transaction proposal(or the closest transaction parameters allowable where the transactionproposal became rejected). Thus, continuing the example discussed withrespect to FIG. 5, area 710 indicates the length of loan slider bar 721as set to 60 months, the sales price slider bar 722 as set to $25,000,the cash down slider bar 723 as set to $1,000, and the warranty costsslider bar 724 as set to $2,500.

A user may operate the device displaying interface 700 (e.g., clientdevice 102) to manipulate the slider bars to change the transactionterms within the allowable range. For example, as depicted in FIG. 7B,the sales price slider bar 722′ may be manipulated to $18,750. In someembodiments, when a user manipulates a slider bar of area 710′, decisionengine 108 may adjust the remaining slider bars as needed to conform tothe underlying transaction policy. For example, as sales price sliderbar 722′ becomes set to $18,750, decision engine 108 may generate area710′ to simultaneously adjust the length of loan slider bar 721′ as setto 68 months, the cash down slider bar 723′ as set to $6,500, and thewarranty costs slider bar 724′ as set to $1,750. Interface 700 mayfurther include a selectable item (e.g., a button) for receivingacceptance of an offer according to the transaction structure indicatedby the slider bars.

Descriptions of the disclosed embodiments are not exhaustive and are notlimited to the precise forms or embodiments disclosed. Modifications andadaptations of the embodiments will be apparent from consideration ofthe specification and practice of the disclosed embodiments. Forexample, the described implementations include hardware, firmware, andsoftware, but systems and methods consistent with the present disclosurecan be implemented as hardware alone. Additionally, the disclosedembodiments are not limited to the examples discussed herein.

Computer programs based on the written description and methods of thisspecification are within the skill of a software developer. The variousprograms or program modules can be created using a variety ofprogramming techniques. For example, program sections or program modulescan be designed in or by means of Java, C, C++, assembly language, orany such programming languages. One or more of such software sections ormodules can be integrated into a computer system, non-transitorycomputer-readable media, or existing communications software.

Moreover, while illustrative embodiments have been described herein, thescope includes any and all embodiments having equivalent elements,modifications, omissions, combinations (e.g., of aspects across variousembodiments), adaptations or alterations based on the presentdisclosure. The elements in the claims are to be interpreted broadlybased on the language employed in the claims and not limited to examplesdescribed in the present specification or during the prosecution of theapplication, which examples are to be construed as non-exclusive.Further, the steps of the disclosed methods can be modified in anymanner, including by reordering steps or inserting or deleting steps. Itis intended, therefore, that the specification and examples beconsidered as exemplary only, with a true scope and spirit beingindicated by the following claims and their full scope of equivalents.

What is claimed is:
 1. A system for reducing computational loadsassociated with predicting transactions using scale-out computing ofanalytical models, comprising: a memory storing instructions; and one ormore processors configured to execute the instructions to performoperations comprising: receiving, via an Application ProgrammingInterface (API), a transaction proposal including a first plurality oftransaction parameters; identifying, via an actor pool associated with adata interface module, a plurality of data sources, the plurality ofdata sources being identified based on the transaction proposal;iteratively verifying, via an actor pool associated with the datainterface module, the plurality of data sources; generating, via aminimally viable transaction (MVT) generator, an MVT, the MVT comprisinga second plurality of transaction parameters and being based on thetransaction proposal; generating, via an actor pool associated with atransaction generator, a first plurality of transaction options, thefirst plurality of transaction options being generated based on thetransaction proposal and the MVT; scoring, via an actor pool associatedwith a scoring engine, the MVT and at least one of the first pluralityof transaction options, the MVT and the transaction options being scoredusing an analytical model; verifying, via an actor pool associated witha policy calculator, that the MVT and the transaction options complywith a transaction policy, the MVT and the transaction options beingverified based on the scoring; optimizing, via an actor pool associatedwith a transaction optimizer, the transaction options based on apreference; and transmitting, via the API: data indicating whether thetransaction proposal is approved, wherein whether the transactionproposal is approved is determined based on whether the MVT complieswith the transaction policy, and at least one transaction offer based onthe optimized transaction options.
 2. The system of claim 1, whereinwhen the transaction proposal is rejected, the transaction generator isfurther configured to cause the one or more processors to generate, viathe actor pool associated with the transaction generator, a secondplurality of transaction options, the second plurality of transactionoptions being generated based on the transaction proposal and the MVT;the scoring engine is further configured to cause the one or moreprocessors to score, via the actor pool associated with the scoringengine, at least one of the second plurality of transaction options, theat least one of the second plurality of transaction options being scoredusing the analytical model; and the policy calculator is furtherconfigured to cause the one or more processors to verify, via the actorpool associated with the policy calculator, that at least one of thesecond plurality of transaction options complies with the transactionpolicy, the at least one of the second plurality of transaction optionsbeing verified based on the scoring, wherein the API is furtherconfigured to cause the one or more processors to transmit the at leastone of the second plurality of transaction options that complies withthe transaction policy.
 3. The system of claim 2, wherein the API isfurther configured to cause the one or more processors to transmit aranking associated with each of the at least one of the second pluralityof transaction options.
 4. The system of claim 1, wherein at least oneof the API, the data interface module, the MVT generator, thetransaction generator, the scoring engine, the policy calculator, or thetransaction optimizer comprise software modules.
 5. The system of claim4, wherein the software modules are operated on a remote system.
 6. Thesystem of claim 1, wherein the MVT represents a maximum extent forvarying the first plurality of transaction parameters.
 7. The system ofclaim 1, wherein the MVT generator comprises instructions that cause theone or more processors to: identify a variation increment for each ofthe first plurality of transaction parameters; and determine a pluralityof transaction parameter variations between the first plurality oftransaction parameters and second plurality of transaction parametersaccording to the variation increment.
 8. The system of claim 1, whereinthe analytical model comprises an applicant rating (AR) model and astructure rating (SR) model.
 9. The system of claim 1, wherein the datainterface module, the transaction generator, the scoring engine, thepolicy calculator, and the transaction optimizer comprise fault-tolerantand scalable applications.
 10. The system of claim 1, wherein the datainterface module, the transaction generator, the scoring engine, thepolicy calculator, and the transaction optimizer are implemented in atleast one of a big data architecture, actor architecture, message busarchitecture, or Lambda-based architecture.
 11. The system of claim 1,wherein at least a portion of the operations are performed in parallel.12. The system of claim 1, wherein at least one of the actor pools isconfigured to expand or contract based on a computational loadassociated with the operations associated with the at least one of theactor pools.
 13. A method for reducing computational loads associatedwith predicting optimal transactions using scale-out computing ofanalytical models, comprising: receiving, via an Application ProgrammingInterface (API), a transaction proposal including a first plurality oftransaction parameters; identifying a plurality of data sources, theplurality of data sources being identified based on the transactionproposal; iteratively verifying the plurality of data sources;generating a minimally viable transaction (MVT), the MVT comprising asecond plurality of transaction parameters and being based on thetransaction proposal; generating a first plurality of transactionoptions, the first plurality of transaction options being generatedbased on the transaction proposal and the MVT; scoring the MVT and atleast one of the first plurality of transaction options, the MVT and thetransaction options being scored using an analytical model; verifyingthat the MVT and the transaction options comply with a transactionpolicy, the MVT and the transaction options being verified based on thescoring; optimizing the transaction options based on a preference; andtransmitting, via the API: data indicating whether the transactionproposal is approved, wherein whether the transaction proposal isapproved is determined based on whether the MVT complies with thetransaction policy, and at least one transaction offer based on theoptimized transaction options.
 14. The method of claim 13, furthercomprising: generating a second plurality of transaction options, thesecond plurality of transaction options being generated based on thetransaction proposal and the MVT; scoring at least one of the secondplurality of transaction options, the at least one of the secondplurality of transaction options being scored using the analyticalmodel; verifying that at least one of the second plurality oftransaction options complies with the transaction policy, the at leastone of the second plurality of transaction options being verified basedon the scoring; and transmitting the at least one of the secondplurality of transaction options that complies with the transactionpolicy.
 15. The method of claim 14, wherein the at least one of thesecond plurality of transaction options are transmitted when thetransaction proposal is rejected.
 16. The method of claim 14, furthercomprising: transmitting a ranking associated with each of the at leastone of the second plurality of transaction options.
 17. The method ofclaim 13, wherein the MVT represents a maximum extent for varying thefirst plurality of transaction parameters.
 18. The method of claim 13,wherein at least one first operation is performed on a first system andat least one second operation is performed on a second system.
 19. Themethod of claim 13, wherein at least a portion of the operations areperformed in parallel.
 20. A method for reducing computational loadsassociated with predicting optimal transactions using scale-outcomputing of analytical models, comprising: receiving, via anApplication Programming Interface (API), a transaction proposalincluding a first plurality of transaction parameters; identifying aplurality of data sources, the plurality of data sources beingidentified based on the transaction proposal; iteratively verifying theplurality of data sources; generating a minimally viable transaction(MVT), the MVT comprising a second plurality of transaction parametersand being based on the transaction proposal; generating a firstplurality of transaction options, the first plurality of transactionoptions being generated based on the transaction proposal and the MVT;scoring the MVT and at least one of the first plurality of transactionoptions, the MVT and the transaction options being scored using ananalytical model; verifying that the MVT and the transaction optionscomply with a transaction policy, the MVT and the transaction optionsbeing verified based on the scoring; optimizing the transaction optionsbased on a preference; generating a second plurality of transactionoptions, the second plurality of transaction options being generatedbased on the transaction proposal and the MVT; scoring at least one ofthe second plurality of transaction options, the at least one of thesecond plurality of transaction options being scored using theanalytical model; verifying that at least one of the second plurality oftransaction options complies with the transaction policy, the at leastone of the second plurality of transaction options being verified basedon the scoring; and transmitting, via the API: data indicating whetherthe transaction proposal is approved, wherein whether the transactionproposal is approved is determined based on whether the MVT complieswith the transaction policy, and at least one of the optimizedtransaction options or at least one of the second plurality oftransaction options that complies with the transaction policy.